two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning

Authors

mir saber salehi mir babol

javad rezaeian babol

abstract

this paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. in addition, the setup time of a job on each machine is proportional to the actual processing time of the already processed jobs on the corresponding machine, i.e., the setup time of a job is past- sequence-dependent (p-s-d). the objective is to determine jointly the jobs assigned to each machine and the order of jobs such that the total completion time (called tc) is minimized. since that the problem is np-hard, optimal solution for the instances of realistic size cannot be obtained within a reasonable amount of computational time using exact solution approaches. hence, an efficient method based on ant colony optimization algorithm (aco) is proposed to solve the given problem. the performance of the presented model and the proposed algorithm is verified by a number of numerical experiments. the related results show that ant colony optimization algorithm is effective and viable approache to generate optimal⁄near optimal solutions within a reasonable amount of computational time.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning

This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...

full text

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

full text

Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

full text

A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

full text

scheduling of unrelated parallel machines using two multi objective genetic algorithms with sequence-dependent setup times and precedent constraints

abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...

full text

Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning

In this paper we consider the single-machine setup times scheduling with general effects of deterioration and learning. By the general effects of deterioration and learning, we mean that the actual job processing time is a general function of the processing times of the jobs already processed and its scheduled position. The setup times are proportional to the length of the already processed job...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of industrial engineering and productional research-

جلد ۲۷، شماره ۱، صفحات ۶۹-۸۸

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023